On Erd\H{o}s-Gallai and Havel-Hakimi algorithms
نویسندگان
چکیده
Havel in 1955 [28], Erdős and Gallai in 1960 [21], Hakimi in 1962 [26], Ruskey, Cohen, Eades and Scott in 1994 [69], Barnes and Savage in 1997 [6], Kohnert in 2004 [49], Tripathi, Venugopalan and West in 2010 [83] proposed a method to decide, whether a sequence of nonnegative integers can be the degree sequence of a simple graph. The running time of their algorithms is Ω(n) in worst case. In this paper we propose a new algorithm called EGL (Erdős-Gallai Linear algorithm), whose worst running time is Θ(n). As an application of this quick algorithm we computed the number of the different degree sequences of simple graphs for 24, . . . , 29 vertices (see [74]).
منابع مشابه
On Erdős-Gallai and Havel-Hakimi algorithms
Havel in 1955 [28], Erdős and Gallai in 1960 [21], Hakimi in 1962 [26], Ruskey, Cohen, Eades and Scott in 1994 [69], Barnes and Savage in 1997 [6], Kohnert in 2004 [49], Tripathi, Venugopalan and West in 2010 [83] proposed a method to decide, whether a sequence of nonnegative integers can be the degree sequence of a simple graph. The running time of their algorithms is Ω(n) in worst case. In th...
متن کاملGraphic Realizations of Joint-Degree Matrices
In this paper we introduce extensions and modifications of the classical degree sequence graphic realization problem studied by Erdős-Gallai and Havel-Hakimi, as well as of the corresponding connected graphic realization version. We define the joint-degree matrix graphic (resp. connected graphic) realization problem, where in addition to the degree sequence, the exact number of desired edges be...
متن کاملAlgorithms for realizing degree sequences of directed graphs
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extends the Havel-Hakimi algorithm to degree sequences for directed graphs. In this paper we go a step further and describe a modification of Kleitman and Wang’s algorithm that is a more natural extension of Havel-Hakimi’s ...
متن کاملI/O-efficient Generation of Massive Graphs Following the LFR Benchmark
LFR is a popular benchmark graph generator used to evaluate community detection algorithms. We present EM-LFR, the first external memory algorithm able to generate massive complex networks following the LFR benchmark. Its most expensive component is the generation of random graphs with prescribed degree sequences which can be divided into two steps: the graphs are first materialized determinist...
متن کاملOn the Swap-Distances of Different Realizations of a Graphical Degree Sequence
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is graphical for short). One method to solve this problem is the greedy algorithm of Havel and Hakimi, which is based on the swap operation. Another, closely related question i...
متن کامل